منابع مشابه
Proving properties of matrices over Z2
We prove assorted properties of matrices over Z2, and outline the complexity of the concepts required to prove these properties. The goal of this line of research is to establish the proof complexity of matrix algebra. It also presents a different approach to linear algebra: one that is formal, consisting in algebraic manipulations according to the axioms of a ring, rather than the traditional ...
متن کاملDistributed methods for synchronization of orthogonal matrices over graphs
This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equal the identity. We formulate the synchronization problem as a leastsquares optimization problem with nonlinear constraints. The synchronization problem appears as one of the key components in applications ranging fro...
متن کاملSemidefinite approximations for quadratic programs over orthogonal matrices
Finding global optimum of a non-convex quadratic function is in general a very difficult task even when the feasible set is a polyhedron. We show that when the feasible set of a quadratic problem consists of orthogonal matrices from Rn×k, then we can transform it into a semidefinite program in matrices of order kn which has the same optimal value. This opens new possibilities to get good lower ...
متن کاملDynamic of cyclic automata over Z2
Let K be the two-dimensional grid. Let q be an integer greater than 1 and let Q={0; : : : ; q−1}. Let s :Q → Q be de0ned by s( ) = ( + 1)mod q, ∀ ∈ Q. In this work we study the following dynamic F on QZ 2 . For x ∈ QZ2 we de0ne Fv(x)= s(xv) if the state s(xv) appears in one of the four neighbors of v in K and Fv(x) = xv otherwise. For x ∈ QZ2 , such that {v∈Z2 : xv = 0} is 0nite we prove that t...
متن کاملDisentangling orthogonal matrices.
Motivated by a certain molecular reconstruction methodology in cryo-electron microscopy, we consider the problem of solving a linear system with two unknown orthogonal matrices, which is a generalization of the well-known orthogonal Procrustes problem. We propose an algorithm based on a semi-definite programming (SDP) relaxation, and give a theoretical guarantee for its performance. Both theore...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1998
ISSN: 0097-3165
DOI: 10.1006/jcta.1997.2854